Method for multiplexing data and control information

ABSTRACT

A method for multiplexing a data information stream, including a systematic symbol and a non-systematic symbol, and a control information stream of at least three types in a wireless mobile communication system is disclosed. The method includes mapping the data information stream to a resource area so that the systematic symbol is not mapped to a specific resource area to which the control information stream is mapped, and mapping the control information stream to the specific resource area.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.13/291,995, filed on Nov. 8, 2011, now U.S. Pat. No. 8,547,923, which isa continuation of U.S. patent application Ser. No. 12/395,544, filed onFeb. 27, 2009, now U.S. Pat. No. 8,094,639, which claims the benefit ofearlier filing date and right of priority to Korean Patent ApplicationNos. 10-2008-0084616, filed on Aug. 28, 2008, and 10-2008-0084617, filedon Aug. 28, 2008, and also claims the benefit of U.S. ProvisionalApplication Ser. Nos. 61/032,412, filed on Feb. 28, 2008, 61/035,054,filed on Mar. 10, 2008, 61/036,066, filed on Mar. 12, 2008, 61/041,929,filed on Apr. 3, 2008, 61/041,973, filed on Apr. 3, 2008, 61/047,404,filed on Apr. 23, 2008, 61/048,297, filed on Apr. 28, 2008, 61/126,326,filed on May 1, 2008, 61/050,732, filed on May 6, 2008, 61/051,398,filed on May 8, 2008, and 61/060,126, filed on Jun. 10, 2008, thecontents of which are hereby incorporated by reference herein in theirentirety.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a method for multiplexing data andcontrol sequences and mapping the multiplexed sequences to a physicalchannel in a wireless mobile communication system.

2. Discussion of the Related Art

Data and control sequences transmitted from a media access control (MAC)layer to a physical layer are encoded and then provide transport andcontrol services through a radio transmission link. A channel codingscheme is comprised of a combination of processes of error detection,error correction, rate matching, interleaving, and mapping of transportchannel information or control information to the physical channel. Datatransmitted from the MAC layer includes systematic bits andnon-systematic bits according to the channel coding scheme. Thenon-systematic bits may be parity bits.

In the 3^(rd) generation partnership project (3GPP), an uplink sharedchannel (UL-SCH) and a random access channel (RACH) of an uplinktransport channel may be mapped to a physical uplink shared channel(PUSCH) and a packet random access channel (PRACH) of a physicalchannel, respectively. Uplink control information (UCI), which is one ofan uplink control channel information, may be mapped to a physicaluplink control channel (PUCCH) and/or a PUSCH. A downlink shared channel(DL-SCH), a broadcast channel (BCH), a paging channel (PCH), and amulticast channel (MCH) of a downlink transport channel are respectivelymapped to a physical downlink shared channel (PDSCH), a physicalbroadcast channel (PBCH), a physical downlink shared channel (PDSCH),and a physical multicast channel (PMCH) of a physical channel. A controlformat indicator (CFI), a hybrid automatic repeat request (HARQ)indicator (HI), and downlink channel information (DCI) of downlinkcontrol channel information are mapped to a physical control formatindicator channel (PCFICH), a physical HARQ indicator channel (PHICH),and a physical downlink control channel (PDCCH) of a physical channel,respectively. The above transport channels are mapped to the respectivephysical channels through multiple processes. Especially, in a channelsuch as a UL-SCH, processing for cyclic redundancy check (CRC), codeblock segmentation, channel coding, rate matching, and code blockconcatenation is performed with respect to at least one transportchannel or control information.

A process for processing a transport channel and/or control informationis illustrated in FIG. 1. Data in the form of a transport block is inputevery transmission time interval (TTI). The transport block is processedas follows. A CRC attachment block attaches a CRC to the data in theform of a transport block. A code block segmentation block segments theCRC-attached data into one or more code blocks. A channel coding blockperforms channel coding for a code block data stream of each of thesegmented code blocks. A rate matching block performs rate matching forthe channel coded data stream. A code block concatenation blockconcatenates one or more rate-matched data streams to form a sequence ofencoded data bits. Meanwhile, a separate channel coding block performschannel coding for control information to form a sequence of encodedcontrol bits. A data/control multiplexing block multiplexes the sequenceof encoded data bits and the sequence of encoded control bits, therebygenerating a sequence of multiplexed bits.

One symbol may be comprised of at least one bit according to amodulation order (Qm). For example, for BPSK, QPSK, 16QAM, and 64QAM,one bit, two bits, four bits, and six bits corresponding respectivelythereto constitute one symbol. In a system using single-carrierfrequency division multiple access (SC-FDMA), one symbol is mapped toone resource element (RE), and therefore, a description can be given inunits of symbols. Accordingly, the terms ‘coded data bit’, ‘codedcontrol bit’, and ‘multiplexed bit’ may be replaced with the terms‘coded data symbol’, ‘coded control symbol’, and ‘multiplexed symbol’,respectively, in consideration of the modulation order, for convenienceof description. The terms ‘coded data bit’, ‘coded data symbol’, ‘codeddata symbol’, ‘coded control bit’, and ‘coded control symbol’ may beabbreviated to ‘data bit’ ‘data symbol’, ‘control bit’ and ‘controlsymbol’, respectively, for convenience of description.

The control information may be classified into one or more typesaccording to properties thereof and various multiplexing schemes may beconsidered according to the number of types.

If only one type of control information is present, when datainformation and control information are multiplexed, the controlinformation may or may not overwrite the data information.

If two types of control information are present, the control informationis divided into a first type of control information and a second type ofcontrol information. If the second type of control information is moreimportant than the first type of control information, data informationand control information may be multiplexed in a manner that the firsttype of control information overwrites or does not overwrite datainformation. Next, the second type of control information may or may notoverwrite the multiplexed data information and/or the first type ofcontrol information.

A process of processing a transport channel for a UL-SCH of the 3GPP isillustrated in FIG. 2. FIG. 2 illustrates a matrix structure of ‘R’ rowsby ‘C’ columns (R*C) (for example, C=14). Hereinafter, such a structuremay be referred to as ‘a set of resource elements’. C successive symbolsare arranged in a time area in a horizontal direction and R virtualsubcarriers are arranged in a frequency area in a vertical direction. Ina set of resource elements, virtual subcarriers are arranged adjacent toeach other but subcarriers on respective physical channels correspondingto the virtual subcarriers may be discontinuous in the frequency area.Hereinafter, the term ‘virtual subcarrier’ related to a set of resourceelements will be referred to as ‘subcarrier’ for brevity. In a normalcyclic prefix structure (‘normal CP structure’), 14 (C=14) symbolsconstitute one sub-frame. In an extended CP structure, 12 (C=12) symbolsmay constitute one sub-frame. That is, FIG. 2 is based on the normal CPstructure. If the ‘extended CP structure’ is used, FIG. 2 may have amatrix structure in which C is 12. Referring to FIG. 2, M symbols (=thenumber of symbols per sub-frame×the number of subcarriers=C×R) may bemapped. Namely, M symbols may be mapped to M resource elements per onesub-frame. In addition to symbols generated by multiplexing data symbolsand control symbols, reference signal (RS) symbols and/or sounding RS(SRS) symbols may be mapped to the M resource elements. Therefore, if KRS symbols and/or SRS symbols are mapped, (M-K) multiplexed symbols maybe mapped.

FIG. 2 shows an example of mapping two types of control information,that is, control information 1 and control information 2 to a set ofresource elements. Referring to FIG. 2, a sequence of multiplexedsymbols is mapped by a time-first mapping method. That is, the sequenceof multiplexed symbols is sequentially mapped from the first symbolposition of the first subcarrier to the right. If mapping ends withinone subcarrier, mapping is sequentially performed from the first symbolposition of the next subcarrier to the right. Hereinbelow, a symbol mayrefer to an SC-FDMA symbol. The control information 1 and datainformation are mapped by a time-first mapping method in order ofcontrol information 1→data information. The control information 2 ismapped only to symbols located at both sides of RS symbols in order oflast subcarrier→first subcarrier. The last subcarrier refers to asubcarrier located at the bottom of a set of resource elements of FIG. 2and the first subcarrier refers to a subcarrier located at the top ofthe set of resource elements. The control information 1 rate-matcheswith data information and is mapped. The control information 2 puncturesthe data information and/or the mapped control information 1 and ismapped. The data information may be formed by sequentially concatenatingmultiple code blocks segmented from one transport block.

When multiplexing data information and control information, thefollowing should be considered.

First, a multiplexing rule should not be changed by the amount and typeof control information or presence/absence of control information.Second, when control information is multiplexed with data by ratematching or control information punctures data and/or other types ofcontrol information, the control information should not affecttransmission of other data of a cyclic buffer. Third, a starting pointof a cyclic buffer for a next redundancy version should not beinfluenced by presence/absence of control information. Fourth, in ahybrid automatic repeat request (HARQ) transmission scheme, HARQ buffercorruption should be able to be avoided. In a method for mappingmultiplexed information to a data channel, a specific type of controlinformation should be mapped to resource elements adjacent to an RSwhich can show good capability.

In the method of FIG. 2, since two types of control information aremapped to a virtual physical channel together with data information, anew rule is demanded to map another type of control information. In themethod of FIG. 2, when the control information 2 punctures the datainformation and/or the control information 1, puncturing is performedfrom the last code block. However, if probability of generating an errorin the last code block by transmission environments and a code rate ishigh, an error may occur only in the last code block. In that case, theerror is detected after all code blocks are decoded, determination of atransmission error is delayed and power consumed to decode the codeblocks is increased.

SUMMARY OF THE INVENTION

An object of the present invention devised to solve the problem lies inproviding a method for mapping control information by a prescribed ruleconsidering presence/absence and type of the control information toimprove the capability of a wireless radio communication system.

The object of the present invention can be achieved by providing amethod for multiplexing data information and a plurality of controlinformation in a wireless mobile communication system, including (a)mapping first control information in units of resource elements on amatrix for generating input information mapped to a set of physicalresource elements so that the first control information is mapped toresource elements separated by one resource element in a time axis fromresource elements to which a reference signal is mapped in the set ofphysical resource elements; (b) mapping a sequence on the matrix inunits of resource elements so that the sequence does not overwrite themapped first control information, wherein the sequence is formed bymultiplexing second information and the data information; and (c)mapping third control information on the matrix in units of resourceelements so that the third control information is mapped to resourceelements adjacent in a time axis to the resource elements to which thereference signal is mapped in the set of physical resource elements.

In another aspect of the present invention, provided herein is awideband wireless mobile communication system, including a data andcontrol multiplexing unit for multiplexing second control informationand data information, and a channel interleaver for multiplexing asequence generated from the data and control multiplexing unit with aplurality of control information, wherein in the channel interleaver,(a) first control information is mapped in units of resource elements ona matrix for generating input information mapped to a set of physicalresource elements so that the first control information is mapped toresource elements separated by one resource element in a time axis fromresource elements to which a reference signal is mapped in the set ofphysical resource elements; (b) the sequence is mapped on the matrix inunits of resource elements so that the sequence does not overwrite themapped first control information; and (c) third control information ismapped on the matrix in units of resource elements so that the thirdcontrol information is mapped to resource elements adjacent in a timeaxis to the resource elements to which the reference signal is mapped inthe set of physical resource elements.

In step (a), the first control information may be mapped upwardsstarting from the last row of the matrix, or may be mapped downwardsstarting from a specific row of the matrix so as to include the last rowof the matrix; in step (b), the sequence may be mapped downwardsstarting from the first row of the matrix; and in step (c), the thirdcontrol information may be mapped upwards starting from the last row ofthe matrix, or may be mapped downwards from a specific row of the matrixso as to include the last row of the matrix.

In step (b), symbols of the sequence mapped within each row may bemapped leftwards, rightwards, or in a specific order in each row.

In step (a), symbols of the first control information mapped to each rowmay be mapped, within each row, rightwards starting from a leftmostelement among elements of the matrix corresponding to resource elementsseparated by one resource element from the resource elements to whichthe reference signal is mapped, may be mapped leftwards from a rightmostelement, or may be mapped in a specific order; and in step (c), symbolsof the third control information mapped to each row may be mapped,within each row, rightwards starting from a leftmost element amongelements of the matrix corresponding to the adjacent resource elements,may be mapped leftwards starting from a rightmost element, or may bemapped in a specific order.

In step (a), symbols of the first control information mapped to each rowmay be mapped, within each row, leftwards starting from a rightmostelement among elements of the matrix corresponding to resource elementsseparated by one resource element from the resource elements to whichthe reference signal is mapped, may be mapped rightwards from a leftmostelement, or may be mapped in a specific order; and in step (c), symbolsof the third control information mapped to each row may be mapped,within each row, leftwards starting from a rightmost element amongelements of the matrix corresponding to the adjacent resource elements,may be mapped rightwards starting from a leftmost element, or may bemapped in a specific order.

In step (a), the first symbol among symbols of the first controlinformation mapped to each row may be mapped, within each row, to aleftmost element among elements of the matrix corresponding to resourceelements separated by one resource element from resource elements towhich the reference signal is mapped, and the other symbols except forthe first symbol may be mapped, within each row, leftwards starting froma rightmost element among elements of the matrix corresponding toresource elements separated by one resource element from resourceelements to which the reference signal is mapped; and, in step (c), thefirst symbol among symbols of the third control information mapped toeach row may be mapped, within each row, to a leftmost element amongelements of the matrix corresponding to the adjacent resource elements,and the other symbols except for the first symbol among symbols of thethird control information may be mapped, within each row, leftwardsstarting from a rightmost element among elements of the matrixcorresponding to the adjacent resource elements.

The first control information may be rank indication (RI), the secondcontrol information may be information including at least one of channelquality information (CQI) and a precoding matrix index (PMI), and thethird control information may be information aboutacknowledgement/negative acknowledgement (ACK/NACK) which is a hybridautomatic repeat request (HARQ) response.

The set of physical resource elements may be comprised of C symbolperiods and R subcarriers, the entire length of the C symbol periods maybe the same as the length of one subframe comprised of two slots, thereference signal may be mapped two symbol periods which are not adjacentto each other among the C symbol periods, the two symbol periods may berespectively allocated to the two slots, the matrix may be comprised of(C-2) columns and R rows, each element of the matrix correspond one byone to each resource element of an area except for the two symbolperiods among the set of physical resource elements, the method mayfurther include, before the mapping step, forming the sequence byarranging the second control information and the data information suchthat the data information is arranged after the second controlinformation, step (a) is performed only when the first controlinformation exists, and step (c) is performed only when the thirdcontrol information exists.

In a further aspect of the present invention, provided herein is amethod for multiplexing data information and a plurality of controlinformation in a wireless mobile communication system. The methodincludes mapping a sequence and third control information on a matrix inunits of resource elements, wherein the sequence is formed bymultiplexing first control information, second control information, anddata information, the matrix is to generate input information mapped toa set of physical resource elements, the first control information andthe third control information are mapped to resource elements adjacentin a time axis to resource elements to which a reference signal ismapped among the set of the physical resource elements, and the sequenceis mapped so as not to overwrite the first control information and thethird control information.

In another aspect of the present invention, provided herein is awideband wireless mobile communication system including a channelinterleaver for multiplexing data information and a plurality of controlinformation, wherein, in the channel interleaver, a sequence and thirdcontrol information are mapped on a matrix for generating inputinformation mapped to a set of physical resource elements, the sequencebeing formed by multiplexing first control information, second controlinformation and the data information; the first control information andthe third control information are mapped to resource elements adjacentin a time axis to resource elements to which a reference signal ismapped among the set of the physical resource elements; and the sequenceis mapped so as not to overwrite the first control information and thethird control information.

The sequence may be mapped starting from the last row of the matrixupwards, the third control information may be mapped starting from thefirst row of the matrix downwards, and the first control information maybe mapped downwards starting from the next row of the bottom row amongrows to which the second control information is mapped.

The sequence may be mapped starting from the first row of the matrixdownwards, the third control information may be mapped starting from thelast row of the matrix upwards, and the first control information may bemapped upwards starting from the next row of the top row among rows towhich the second control information is mapped.

The sequence may be mapped starting from the last row of the matrixupwards, the third control information may be mapped starting from thefirst row of the matrix downwards, and the first control information maybe mapped upwards starting from the next row of the top row among rowsto which the second control information is mapped.

The sequence may be mapped starting from the first row of the matrixdownwards, the third control information may be mapped starting from thelast row of the matrix upwards, and the first control information may bemapped downwards starting from the next row of the bottom row among rowsto which the second control information is mapped.

The sequence may be mapped upwards starting from the last row of thematrix, the third control information may be mapped downwards startingfrom the first row of the matrix, alternating rows, and the firstcontrol information may be mapped downwards starting from the second rowof the matrix, alternating rows.

The sequence may be mapped starting from the last row of the matrixupwards, the first control information may be mapped downwards startingfrom the first row of the matrix, alternating rows, and the thirdcontrol information may be mapped downwards starting from the second rowof the matrix, alternating rows.

At least one of the sequence, the first control information, and thethird control information may be mapped leftwards starting from a rightcolumn within each row, may be mapped rightwards starting from a leftcolumn, or may be mapped in a specific order, and the other one exceptfor the at least one of the sequence, the first control information, andthe third control information may be mapped rightwards starting from aleft column within each row, may be mapped leftwards starting from aright column, or may be mapped in a specific order.

The set of physical resource elements may be comprised of C symbolperiods and R subcarriers, the entire length of the C symbol periods maybe the same as the length of one subframe comprised of two slots, thereference signal may be mapped two symbol periods which are not adjacentto each other among the C symbol periods, the two symbol periods may berespectively allocated to the two slots, the matrix may be comprised of(C-2) columns and R rows, each element of the matrix correspond one byone to each resource element of an area except for the two symbolperiods among the set of physical resource elements, and the method mayfurther include, before the mapping step, forming the sequence byarranging the second control information and the data information suchthat the data information is arranged after the second controlinformation.

The first control information may be RI, the second control informationmay be information including at least one of CQI and a PMI, and thethird control information may be information about ACK/NACK which is aresponse of HARQ.

In mapping data and control information, uniform multiplexing andmapping rules considering presence/absence of control information and atype of control information are provided.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are included to provide a furtherunderstanding of the invention, illustrate embodiments of the inventionand together with the description serve to explain the principle of theinvention.

In the drawings:

FIG. 1 illustrates processing for a transport channel and/or controlinformation;

FIG. 2 illustrates an example of transport channel processing for aUL-SCH of 3GPP;

FIGS. 3 a to 6 b are views for defining terms which are commonly used toexplain embodiments of FIG. 7 to FIG. 13;

FIG. 7 illustrates a method for multiplexing and mapping datainformation and control information to a set of resource elementsaccording to an exemplary embodiment of the present invention;

FIG. 8 illustrates a method for multiplexing and mapping datainformation and control information to a set of resource elementsaccording to another exemplary embodiment of the present invention;

FIG. 9 illustrates a method for multiplexing and mapping datainformation and control information to a set of resource elementsaccording to a further exemplary embodiment of the present invention;

FIGS. 10 and 11 illustrate a method for multiplexing and mapping datainformation and control information to a set of resource elementsaccording to another exemplary embodiment of the present invention;

FIGS. 12 and 13 illustrate a method for multiplexing and mapping datainformation and control information to a set of resource elementsaccording to another exemplary embodiment of the present invention;

FIGS. 14 a and 14 b illustrate configurations of an exemplary embodimentin which a normal CP and an extended CP are respectively used;

FIGS. 15 a and 15 b illustrate exemplary structures of an extended;

FIGS. 16 and 17 illustrate an example of locations to which an SRS andan RS are allocated within one subframe in case of a normal CP and anextended CP, respectively;

FIGS. 18 a to 18 f illustrate a mapping order of control information 2and/or control information 3 in a time direction within one;

FIGS. 19 a to 21 b are views explaining in detail the methods of FIGS.18 a to 18 f and illustrate examples of applying the methods of FIGS. 18a to 18 f to a set of resource elements having a matrix structure ofR×C; and

FIG. 22 illustrates a processing structure for a UL-SCH transportchannel according to an exemplary embodiment of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

Reference will now be made in detail to the exemplary embodiments of thepresent invention with reference to the accompanying drawings. Thedetailed description, which will be given below with reference to theaccompanying drawings, is intended to explain exemplary embodiments ofthe present invention, rather than to show the only embodiments that canbe implemented according to the invention. The following detaileddescription includes specific details in order to provide a thoroughunderstanding of the present invention. However, it will be apparent tothose skilled in the art that the present invention may be practicedwithout such specific details. For example, the following descriptionwill be given centering on specific terms, but the present invention isnot limited thereto and any other terms may be used to represent thesame meanings. The same reference numbers will be used throughout thisspecification to refer to the same or like parts.

In actual implementation, each element in a block diagram may be dividedinto two hardware chips, or two or more elements may be integrated intoone hardware chip.

Exemplary embodiments described hereinbelow may be used for processingof a transport channel, especially a UL-SCH, of the 3GPP.

Control information may be classified into various types according to anarbitrary method or ‘importance’ thereof. Here, ‘importance’ may bedetermined by evaluating a degree of influence on the capability of awireless mobile communication system when any type of controlinformation fails in transmission. When multiple types of controlinformation are present, a new multiplexing scheme is required toimprove the capability of a wireless mobile communication system. Forexample, control information of a more important type may be multiplexeds as not to be overwritten by control information of a less importanttype.

In the present invention, control information 1 may be channel qualityinformation (CQI)/precoding matrix index (PMI) which is a combination ofCQI indicating channel quality and of a PMI indicating index informationof a codebook used for pre-coding. The control information 1 mayrate-match with data information for multiplexing. Control information 2may be acknowledgement/negative acknowledgement (ACK/NACK) which is aHARQ response. The control information 2 may puncture the datainformation or the control information 1 for multiplexing. Controlinformation 3 may be a rank indication or rank information (RI)indicating the number of transport streams. The control information 3may puncture the data information or the control information 1 or mayrate-match with the data information and/or the control information 1,for multiplexing.

Structures of exemplary embodiments proposed by the present inventionmay be modified and applied to a structure of up-down or right-leftsymmetry with respect to a frequency axis and a time axis in a set ofresource elements comprised of resource elements. In the exemplaryembodiments of the present invention, a symbol may be an SC-FDMA symbol.

The term ‘puncturing’ refers to eliminating a specific bit (or symbol)from a sequence comprised of multiple bits (or symbols) and inserting anew bit (or symbol) into the sequence. That is, puncturing serves toreplace a part of information with other information, and when datainformation or control information is multiplexed, a bit (or symbol) ofpunctured information is replaced with puncturing information. When apuncturing scheme is used, the length of whole bits (or symbols) ismaintained even after new information is inserted. A code rate ofpunctured information is influenced by puncturing.

The term ‘rate matching’ refers to adjusting a code rate of datainformation. When data information or control information ismultiplexed, the location of each information may be changed butcontents of information are not influenced. ‘Rate matching’ of controlinformation 1 and data information represents that the amount of addingrate-matched control information and rate-matched data information has aprescribed size. Therefore, if the amount of control information 1 to betransmitted is increased, the amount of data information rate-matchingwith the control information 1 is decreased by that much.

If a transport block is segmented into multiple code blocks fortransmission, a receiving side can sequentially decode the code blocksfrom a code block No. 0. At this time, if the code blocks are puncturedusing control information from the last code block of data information,an error may occur only in the last code block due to transmissionenvironments and a code rate. Then error detection is delayed andconsiderable power is consumed in decoding the code blocks. If controlinformation which punctures data is present, since puncturing isperformed beginning from the front code block, an early stop is possiblein a decoding process.

Multiple code blocks generated from the code block segmentation block ofFIG. 1 may have different sizes. In this case, the front code block mayhave a smaller size than a rear code block. In this case, the respectivecode blocks may rate-match in the rate matching block of FIG. 1 so thatthe code blocks of different sizes have the same size. Then the frontcode block having a relatively short length has a lower code rate thanthe rear code block having a long length. Therefore, when code blocksare punctured by control information, the front code block is lessinfluenced by the rear code block.

In the exemplary embodiments of FIG. 7 to FIG. 12, when data informationis punctured by control information, for example, control information 2,the data information is punctured beginning from the first code block.Then a probability of generating an error at the first code block isrelatively increased. If an error is generated at the first code block,since it is possible to early determine whether a transmission erroroccurs, power consumed for decoding of code blocks can be decreased.Compared with a conventional method, the influence of puncturing on datainformation is relatively reduced.

FIG. 3 a to FIG. 6 b are views for defining terms commonly used in thisapplication to describe the exemplary embodiments of FIG. 7 to FIG. 13.

A set of resource elements shown in FIG. 3 a to FIG. 13 is based on aconfiguration of a normal CP and it is assumed that M (=R×C) resourceelements are constructed. Here, ‘C’ denotes the number of ‘symbolperiods’ arranged in a time direction, and ‘R’ denotes the number ofsubcarriers arranged in a virtual frequency direction. The symbol periodrefers to a time period at which one symbol exits. Accordingly, thelength of one symbol period is identical to the length of one symbol.

For the following description, a subcarrier located in the first rowfrom the top in the whole area of a set of resource elements is definedas ‘subcarrier 0’, and a subcarrier located in the last row is definedas ‘subcarrier R-1’. That is, the first subcarrier in a transmissionband is defined as ‘subcarrier 0’, and the next subcarriers aresequentially defined as ‘subcarrier 1’, ‘subcarrier 2’, and the like.The last subcarrier is defined as ‘subcarrier R-1’.

FIGS. 3 a, 3 b, 4 a, and 4 b illustrate the concept for describing theexemplary embodiments of the present invention. In the followingdescription, the terms ‘first subcarrier’ and ‘last subcarrier’ may beused in relation to a specific time-frequency area (‘area A’). The areaA may be a part of a set of resource elements or the entire set ofresource elements. The area A indicates any area in a set of resourceelements and respective resource elements in the area A may be separatedfrom each other in time or frequency as illustrated in FIG. 4 b. The‘first subcarrier’ of the area A denotes a subcarrier of a row at thetop of the area A and the last subcarrier of the area A denotes asubcarrier of a row at the bottom of the area A. A ‘first resourceelement’(‘F’) and a ‘last resource element’ (‘L’) are used inconjunction with the area A. Namely, the ‘first resource element’ of thearea A denotes a resource element located most ahead in time in thefirst subcarrier of the area A, that is, a resource element in theleftmost column. The ‘last resource element’ denotes a resource elementlocated latest in time in the last subcarrier of the area A, that is, aresource element in the rightmost column. The first resource elementwithin one subcarrier refers to a resource element which is most aheadin time within the subcarrier. The last resource element refers to aresource element which is the latest in time within that subcarrier.

Referring to FIG. 5 a, an RS is mapped to an ‘RS symbol period’comprised of ‘RS symbol period(0)’ and ‘RS symbol period(1)’. The RSsymbol period(0) and the RS symbol period(1) may not be adjacent to eachother.

An ‘RS symbol period area’ defined in the ‘RS symbol period’ will now bedescribed. The RS symbol period area includes (2×R) resource elementslocated in the RS symbol period. The ‘RS symbol period area’ is dividedinto ‘RS symbol period area(0)’ and ‘RS symbol period area(1)’. Each ofthe RS symbol period area(0) and the RS symbol period area(1) has Rresource elements in a frequency direction.

Referring to FIG. 5 b, a ‘first symbol period’ is defined as 4 symbolperiods separated from the RS symbol period by a zero symbol period. A‘first symbol period area’ includes (4×R) resource elements located inthe first symbol period. Therefore, in FIGS. 3 a to 6 b, the ‘firstsymbol period’ is further divided into ‘first symbol period area(0)’,‘first symbol period area(1)’, ‘first symbol period area(2)’, and ‘firstsymbol period area(3)’.

Referring to FIG. 5 c, a ‘second symbol period’ is defined as 4 symbolperiods separated from the RS symbol period by one symbol period. A‘second symbol period area’ includes (4×R) resource elements located inthe second symbol period. Therefore, in FIGS. 3 a to 6 b, the ‘secondsymbol period area’ is further divided into ‘second symbol periodarea(0)’, ‘second symbol period area(1)’, ‘second symbol periodarea(2)’, and ‘second symbol period area(3)’.

RS symbol periods shown in FIGS. 3 a to 13 are not always located in thefourth and eleventh symbol periods.

The RS symbol period area, the first symbol period area, and the secondsymbol period area may be regarded as the area A.

The term ‘forward mapping order’ is used in relation to the area A.Being mapped in the forward mapping order from a specific resourceelement in the area A refers to a 2-dimensional mapping method in which,within the area A, mapping is performed from a subcarrier to which aspecific resource element belongs in a downward direction, and, withineach subcarrier, mapping is performed according to time flow, that is,from a left column to a right column. For example, mapping in theforward mapping order from the first resource element of the whole areadepicted in FIG. 3 a means that mapping is performed in order of fromsubcarrier 0 to subcarrier N-1 along arrows (dotted lines) (refer toFIG. 6 a). A backward mapping order indicates a method of the reverseorder to the forward mapping order. Being mapped in the backward mappingorder from a specific resource element in the area A refers to a2-dimensional mapping method in which, within the area A, mapping isperformed from a subcarrier to which a specific resource element belongsin an upward direction, and, within each subcarrier, mapping isperformed in reverse order of time flow, that is, from a right column toa left column. For example, if mapping is performed in the backwardmapping order from the last resource element of the whole area depictedin FIG. 3 a, mapping is performed in order of from subcarrier N-1 tosubcarrier 0 along arrows (dotted lines) (refer to FIG. 6 b).

Although a set of resource elements shown in FIGS. 3 a to 13 is based onthe configuration of a normal CP, the same principle may be applied tothe configuration of an extended CP comprised of 12 symbols.

Embodiment 1

FIG. 7 illustrates a method for multiplexing and mapping datainformation and control information to a set of resource elementsaccording to an exemplary embodiment of the present invention.

Referring to FIG. 7, control information 1 is mapped in a time axis(symbol axis) direction and control information 2 is mapped to resourceelements corresponding to symbols next to symbols to which an RS ismapped. That is, the control information 2 is mapped to theabove-described first symbol period area.

The control information 1 is mapped to one or more successive resourceelements including the last resource element except for resourceelements allocated for RS mapping within the whole area shown in FIG. 7.The control information 1 may be mapped in order of (1)→(2). Namely, thecontrol information 1 may be mapped in a forward mapping order from thefirst resource element of an area to which the control information 1 ismapped. Alternatively, the control information 1 may be mapped in orderof (2)→(1). That is, the control information 1 may be mapped in abackward mapping order from the last resource element of the area towhich the control information 1 is mapped.

The control information 2 is mapped to resource elements located justbefore or just after resource elements to which the RS is mapped. Forexample, if the RS is mapped to a j-th resource element, the controlinformation 2 may be mapped to a (j−1)-th resource element and a(j+1)-th resource element. The control information 2 is mapped in aforward, backward, or specific mapping order in the first symbol periodarea.

The above method may be modified to up-down or right-left symmetry in aset of resource elements of FIG. 7. Namely, the control information 1may be mapped to one or more successive resource elements including thefirst resource element, except for the resource elements allocated forRS mapping in the whole area shown in FIG. 7. In this case, the controlinformation 1 may be mapped in a forward or backward mapping order. Thecontrol information 2 is mapped to the first symbol period area and maybe mapped in a forward, backward, or specific mapping order in the firstsymbol period area.

In FIG. 7, the control information 1 does not puncture data information.In other words, the control information 1 rate-matches with the datainformation. The control information 1 may be constructed in such a formthat control information having different properties is concatenated.The control information 2 may puncture the data information and/or thecontrol information 1 in the first symbol period area. If the number ofsymbols of the control information 2 is greater than the number ofresource elements of the first symbol period area, the controlinformation 2 may puncture the control information 1 mapped outside thefirst symbol period area.

Embodiment 2

FIG. 8 illustrates a method for multiplexing and mapping datainformation and control information to a set of resource elementsaccording to another exemplary embodiment of the present invention.

In FIG. 8, control information 1 is mapped by the same method as themethod used in FIG. 7. Control information 2 and control information 3are mapped to a first symbol period area. The control information 2 ismapped in a forward, backward, or specific mapping order in the firstsymbol period area. The control information 3 is mapped in a forward,backward, or specific mapping order in an area except for an area towhich the control information 2 is mapped in the first symbol periodarea. If the control information 3 does not exist, the method of FIG. 8is the same as the method of FIG. 7.

In FIG. 8, the control information 1 does not puncture data information.Namely, the control information 1 rate-matches with the datainformation. The control information 1 may be constructed in such a formthat control information having different properties is concatenated.The control information 2 and/or the control information 3 may puncturethe data information and/or the control information 1 in the firstsymbol period area. If the sum of the number of symbols of the controlinformation 2 and the number of symbols of the control information 3 isgreater than the number of resource elements of the first symbol periodarea, the control information 2 and/or the control information 3 maypuncture the control information 1 outside the first symbol period area.Alternatively, the control information 2 and/or the control information3 may be transmitted through resource elements ensured by rate matchingfor the data information.

If the sum of the number of symbols of the control information 2 and thenumber of symbols of the control information 3 is greater than thenumber of resource elements of the first symbol period area, controlinformation having a higher priority of the control information 2 andcontrol information 3 may replace control information having a lowerpriority for mapping. In other words, all the control information of ahigh priority is first mapped to the first symbol period area and Ninformation out of the control information of a low priority is mappedto the first symbol period area. Here, N is a value obtained bysubtracting the number of resource elements to which the controlinformation of a higher priority is mapped from the number of resourceelements of the first symbol period area. For example, if a priority ofthe control information 2 is higher than a priority of the controlinformation 3, all the control information 2 is first mapped to thefirst symbol period area and the control information 3 is mapped to theremaining resource elements in the first symbol period area. Therefore,a part of the control information 3 may not be mapped to the firstsymbol period area.

The method of FIG. 8 may be modified to up-down or right-left symmetryin the set of resource elements of FIG. 8 as illustrated in FIG. 7.Namely, the control information 1 may be mapped to one or moresuccessive resource elements including the first resource element,except for resource elements to which an RS is mapped in a set ofresource elements. In this case, the control information 1 may be mappedin a forward or backward mapping order. The control information 2 may bemapped in a forward, backward, or specific mapping order in the firstsymbol period area. The control information 3 may be mapped in aforward, backward, or specific mapping order from a next resourceelement of the last resource element to which the control information 2is mapped.

Embodiment 3

FIG. 9 illustrates a method for multiplexing and mapping datainformation and control information to a set of resource elementsaccording to a further exemplary embodiment of the present invention.

In FIG. 9, control information 1 is mapped by the same method as themethod used in FIG. 7. Control information 2 and control information 3are mapped to resource elements of the first symbol period area. Thecontrol information 2 is mapped in a forward, backward, or specificmapping order in the first symbol period area. The control information 3may be mapped in a forward, backward, or specific mapping order to thefirst symbol period area, except for an area to which the controlinformation 1 is mapped within the first symbol period area. If thecontrol information 2 does not exist, the control information 1 and thecontrol information 3 are mapped with dropping the control information 2in FIG. 9, and if the control information 3 does not exist, the controlinformation 1 and the control information 2 may be mapped with droppingthe control information 3 in FIG. 9.

In FIG. 9, the control information 1 does not puncture data information.That is, the control information 1 rate-matches with the datainformation. The control information 1 may be constructed in such a formthat control information having different properties is concatenated.The control information 2 and/or the control information 3 may puncturethe data information and/or the control information 1 in the firstsymbol period area. If the sum of the number of symbols of the controlinformation 2 and the number of symbols of the control information 3 isgreater than the number of resource elements of the first symbol periodarea, the control information 2 and/or the control information 3 maypuncture the control information 1 outside the first symbol period area.Alternatively, the control information 2 and/or the control information3 may be transmitted through resource elements ensured by rate matchingfor the data information.

If the sum of the number of symbols of the control information 2 and thenumber of symbols of the control information 3 is greater than thenumber of resource elements of the first symbol period area, controlinformation of a higher priority of the control information 2 and thecontrol information 3 may replace control information of a lowerpriority for mapping. This is the same as described in FIG. 8.

The method of FIG. 9 may be modified to up-down or right-left symmetryin the set of resource elements of FIG. 9 as described in FIG. 7.Namely, the control information 1 may be mapped to one or moresuccessive resource elements including the first resource element,except for resource elements allocated for RS mapping in a set ofresource elements. In this case, the control information 1 may be mappedin a forward or backward mapping order. The control information 2 ismapped in a forward, backward, or specific mapping order in the firstsymbol period area. The control information 3 may be mapped in aforward, backward, or specific mapping order to the first symbol periodarea, except for an area to which the control information 1 is mappedwithin the first symbol period area.

Embodiment 4

FIGS. 10 and 11 illustrate a method for multiplexing and mapping datainformation and control information to a set of resource elementsaccording to another exemplary embodiment of the present invention.

In FIG. 10, control information 1 is mapped by the same method as themethod used in FIG. 7. Control information 2 and control information 3are mapped to a first symbol period area. The control information 2 andcontrol information 3 may alternate with each other for mapping in thefirst symbol period area in units of subcarriers. Namely, 4 symbols ofthe control information 2 are mapped to resource elements of the firstsubcarrier of a whole area shown in FIG. 10, and 4 symbols of thecontrol information 3 are mapped to resource elements of the secondsubcarrier. This process is repeated in units of subcarriers. Assumingthat the number of symbols of the control information 2 is less than thenumber of symbols of the control information 3, all the symbols of thecontrol information 2 are mapped and thereafter the symbols of thecontrol information 3 may be mapped to the remaining subcarriers in thefirst symbol period area. If the number of the symbols of the controlinformation 3 is less than the number of the symbols of the controlinformation 2, the same mapping principle may be applied.

Alternatively, the control information 2 may first be mapped to thefirst, third, and fifth subcarriers of the whole area shown in FIG. 10,and next the control information 3 may be mapped to resource elements towhich the control information 2 is not mapped in the first symbol periodarea.

In FIG. 10, the control information 1 does not puncture datainformation. Namely, the control information 1 rate-matches with thedata information. The control information 1 may be constructed in such aform that control information having different properties isconcatenated. The control information 2 and/or the control information 3may puncture the data information and/or the control information 1 inthe first symbol period area. If the sum of the number of symbols of thecontrol information 2 and the number of symbols of the controlinformation 3 is greater than the number of resource elements of thefirst symbol period area, the control information 2 and/or the controlinformation 3 may puncture the control information 1 outside the firstsymbol period area. Alternatively, the control information 2 and/or thecontrol information 3 may be transmitted through resource elementsensured by rate matching for the data information.

If the sum of the number of the symbols of the control information 2 andthe number of the symbols of the control information 3 is greater thanthe number of resource elements belonging to the first symbol periodarea, control information having a higher priority of the controlinformation 2 and the control information 3 may replace controlinformation having a lower priority. This is the same as described inFIG. 8.

The method of FIG. 10 may be modified to up-down or right-left symmetryin a set of resource elements, as described in FIG. 7. That is, thecontrol information 1 may be mapped to one or more successive resourceelements including the first resource element, except for resourceelements allocated for RS mapping in a set of resource elements. Thecontrol information 2 may be mapped in a backward mapping order from thelast resource element of the last subcarrier in the first symbol periodarea. The control information 2 and the control information 3 mayalternate with each other in the first symbol period area in units ofsubcarriers. Namely, 4 symbols of the control information 2 are mappedto the last subcarrier of the whole area shown in FIG. 10, and 4 symbolsof the control information 3 are mapped to the second to the lastsubcarrier. This process may be repeated in units of subcarriers.

FIG. 11 is the same as FIG. 10 except that the locations of the controlinformation 2 and the control information 3 are interchanged.

Embodiment 5

FIG. 12 illustrates a method for multiplexing and mapping datainformation and control information to a set of resource elementsaccording to another exemplary embodiment of the present invention.

In FIG. 12, control information 1 is mapped by the same method as themethod used in FIG. 7. Control information 2 is mapped to the firstsymbol period area, and control information 3 is mapped to resourceelements of a symbol period separated from the RS symbol period by onesymbol period. Namely, the control information 3 is mapped to theabove-described second symbol period area. The control information 2 ismapped in a forward, backward, or specific mapping order in the firstsymbol period area. The control information 3 is mapped in a forward,backward, or specific mapping order in the second symbol period area. Ifthe control information 3 does not exist, the method of FIG. 12 is thesame as the method of FIG. 7. If the control information 2 does notexist, the control information 1 and the control information 3 aremapped with dropping the control information 2 in FIG. 12, and if thecontrol information 3 does not exist, the control information 1 and thecontrol information 2 may be mapped with dropping the controlinformation 3 in FIG. 12.

If the control information 3 is multiplexed by a puncturing scheme,puncturing of the control information 1 can be reduced by mapping thecontrol information 3 to the second symbol period area, that is, toresource elements next to resource elements to which the controlinformation 2 is mapped.

In FIG. 12, the control information 1 does not puncture datainformation. Namely, the control information 1 rate-matches with thedata information. The control information 1 may be constructed in such aform that control information having different properties isconcatenated. The control information 2 may puncture the datainformation and/or the control information 1 in the first symbol periodarea. The control information 3 may puncture the data information and/orthe control information 1 in the second symbol period area.Alternatively, the control information 2 and/or the control information3 may be transmitted through resource elements ensured by rate matchingfor the data information. For example, the control information 2 maypuncture the data information and the control information 1, and controlinformation 3 may rate-match with the data information and/or thecontrol information 1 so that the control information 3 are insertedbetween the data information and/or control information 1.

If the number of symbols of the control information 2 is greater thanthe number of resource elements of the first symbol period area, thecontrol information 2 may puncture the control information 1 outside thefirst symbol period area. If the number of symbols of the controlinformation 3 is greater than the number of resource elements of thesecond symbol period area, the control information 3 may puncture thecontrol information 1 outside the second symbol period area.

The method of FIG. 12 may be modified to up-down or right-left symmetryin a set of resource elements. Such a configuration will now bedescribed in conjunction with FIG. 13.

Embodiment 6

FIG. 13 illustrates a method for multiplexing and mapping datainformation and control information to a set of resource elementsaccording to another exemplary embodiment of the present invention.

In FIG. 13, control information 1 may be mapped to one or moresuccessive resource elements including the first resource element,except for resource elements allocated for RS mapping in a whole areashown in FIG. 13. Control information 2 is mapped to the above-describedfirst symbol period area and control information 3 is mapped to theabove-described second symbol period area. Namely, the controlinformation 2 is mapped to a symbol period before and after a symbolperiod to which the RS is mapped, and the control information 3 ismapped to a symbol period separated by one symbol period from the symbolperiod to which the RS is mapped. The control information 2 may bemapped in a forward, backward, or specific mapping order in the firstsymbol period area. The control information 3 may be mapped in aforward, backward, or specific mapping order in the second symbol periodarea. If the control information 2 does not exist, the controlinformation 1 and the control information 3 may be mapped with droppingthe control information 2 in FIG. 13, and if the control information 3does not exist, the control information 1 and the control information 2may be mapped with dropping the control information 3 in FIG. 13.

If the control information 3 is multiplexed in a manner of puncturingother information, puncturing of the control information 1 can bereduced by mapping the control information 3 to the second symbol periodarea, that is, to resource elements next to resource elements to whichthe control information 2 is mapped.

In FIG. 13, the control information 1 does not puncture datainformation. Namely, the control information 1 rate-matches with thedata information. The control information 1 may be constructed in such aform that control information having different properties isconcatenated. The control information 2 may puncture the datainformation and/or the control information 1 mapped to the first symbolperiod area. The control information 3 may puncture the data informationand/or the control information 1 mapped to the second symbol periodarea.

Alternatively, the control information 2 and/or the control information3 may be transmitted through resource elements ensured through ratematching for the data information. For example, the control information2 may puncture the data information and the control information 1, andthe control information 3 may rate-match with the data informationand/or the control information 1 so that the control information 3 areinserted between the data information and/or the control information 1.

If the number of symbols of the control information 2 is greater thanthe number of resource elements of the first symbol period area, thecontrol information 2 may puncture the control information 1 outside thefirst symbol period area. If the number of symbols of the controlinformation 3 is greater than the number of resource elements of thesecond symbol period area, the control information 3 may puncture thecontrol information 1 outside the second symbol period area.

In the embodiment of FIG. 13, the control information 1 may bemultiplexed with the data information before being mapped to a set ofresource elements. That is, the control information 1 and the datainformation are multiplexed to generate a multiplexed stream so that thedata information is arranged after the control information 1. Next, themultiplexed stream is mapped in a forward mapping order from the firstresource element of a whole area shown in FIG. 13, or in a backwardmapping order from the last resource element of the whole area shown inFIG. 10. By such a method, the control information 1 can be mapped toone or more successive resource elements including the first or lastresource element, except for resource element allocated for RS mappingin the whole area shown in FIG. 10. It will be appreciated that even ifthe control information 1 does not exist, the above-describedembodiments may be used. If the control information 2 does not exist,the control information 1 and the control information 3 are mapped withdropping the control information 2 in FIG. 13, and if the controlinformation 3 does not exist, the control information 1 and the controlinformation 2 may be mapped with dropping the control information 3 inFIG. 13.

Since the structure of FIG. 13 is symmetrical to the structure of FIG.12, the method in FIG. 13 shares characteristics described in FIG. 12.Hereinafter, in the method of FIG. 12 or FIG. 13, the location of thecontrol information 3 will be described in detail with reference toTable 1 to Table 9.

Before a description of Table 1 to Table 9 is given, the above-describedembodiments of FIGS. 7 to 13 will be described in more detail. Thecontrol information 1 may be multiplexed with the data informationbefore being mapped to a set of resource elements. Namely, the controlinformation 1 and the data information are multiplexed to generate amultiplexed stream so that the data information is arranged after thecontrol information 1. Next, the multiplexed stream is mapped in aforward mapping order from the first resource element of the whole areashown in each drawing, or in a backward mapping order from the lastresource element of the whole area shown in each drawing. By such amethod, the control information 1 can be mapped to one or moresuccessive resource elements including the first or last resourceelement, except for resource elements allocated for RS mapping withinthe whole area of a set of resource elements. Even though the controlinformation 1 does not exist, it will be appreciated that theabove-described embodiments may be used.

In the embodiments of FIGS. 8 to 13, if the control information 2 doesnot exist, the control information 1 and the control information 3 aremapped without the control information 2 in each drawing, and if thecontrol information 3 does not exist, the control information 1 and thecontrol information 2 may be mapped without the control information 3 ineach drawing.

In the method of FIG. 12 or FIG. 13, the location of the controlinformation 3, that is, the second symbol period may be defined as inany one of the following Table 1 to Table 9. Table 1 to Table 9 indicatea symbol period to which the control information 3 can be mappedaccording to a configuration of a cyclic prefix (CP) and a configurationof a sounding reference signal (SRS). Although in FIG. 12 or FIG. 13 anormal CP is used as a CP, an extended CP may be applied by the samemethod.

FIG. 14 a illustrates a configuration of an exemplary embodiment inwhich a normal CP is used, and FIG. 14 b illustrates a configuration inwhich an extended CP is used.

A symbol period to which data information and control information aremapped may be changed by the configuration of a CP or the configurationof an SRS. When a normal CP is used, one subframe is comprised of 14symbol periods as shown in FIG. 14 a. It is assumed in Table 1 to Table9 that an RS is located in the fourth (‘{circle around (4)}’) andeleventh (‘{circle around (11)}’) symbol periods among the 14 symbolperiods. When an extended CP is used, one subframe is comprised of 12symbol periods as shown in FIG. 14 b. It is assumed in Table 1 to Table7 that the RS is located in the fourth (‘{circle around (4)}’) and tenth(‘{circle around (10)}’) symbol periods. Meanwhile, symbol periods inwhich the RS is located may be changed unlike Table 1 to Table 9, and inthis case symbol periods to which the data information and the controlinformation are mapped may be changed unlike Table 1 to Table 9.

In Table 1 to Table 9, numbers within ‘{ }’ of ‘Column Set’ indicatesymbol periods to which the control information 3 can be mapped. Thesenumbers are allocated except for symbol periods allocated for RS mappingin FIGS. 14 a and 14 b. In more detail, numbers in ‘{ }’ denote symbolperiods corresponding to numbers arranged in the bottom of FIG. 14 aand/or FIG. 14 b. Numbers in ‘{ }’ may be 0 to 11 in the normal CP andmay be 0 to 9 in the extended CP.

Table 1 to Table 9 include configurations in which an SRS is mapped tothe first symbol period and to the last symbol period. In Table 1 toTable 9, ‘First SC-FDMA symbol’ means that the SRS is mapped to thefirst symbol period, ‘Last SC-FDMA symbol’ means that the SRS is mappedto the last symbol period, and ‘No SRS’ means that no SRS is mapped.

TABLE 1 CP Configuration SRS Configuration Column Set Normal No SRS {1,4, 7, 10} First SC-FDMA symbol {0, 3, 6, 9} Last SC-FDMA symbol {1, 4,7, 10} Extended No SRS {1, 4, 6, 9} First SC-FDMA symbol {0, 3, 5, 8}Last SC-FDMA symbol {1, 4, 6} or {1, 4, 5, 6} or {0, 1, 4, 6} or {0, 1,4, 5}

In Table 1, in the last SC-FDMA symbol of the extended CP, one ofmultiple column sets may be used.

TABLE 2 CP Configuration SRS Configuration Column Set Normal No SRS {1,4, 7, 10} First SC-FDMA symbol {0, 3, 6, 9} Last SC-FDMA symbol {1, 4,7, 10} Extended No SRS {1, 4, 6, 9} First SC-FDMA symbol {0, 3, 5, 8}Last SC-FDMA symbol {1, 4, 6, 9}

In the extended CP, an SRS may not be permitted to be mapped to the lastsymbol period, or even if the SRS is permitted, the SRS may be dropped.Then as illustrated in Table 2, the ‘Last SC-FDMA symbol’ may have thesame column set as the ‘No SRS’.

TABLE 3 CP Configuration SRS Configuration Column Set Normal No SRS {1,4, 7, 10} First SC-FDMA {0, 3, 6, 9} symbol Last SC-FDMA symbol {1, 4,7, 10} Extended No SRS {1, 4, 6, 9} First SC-FDMA {0, 3, 5, 8} symbolLast SC-FDMA symbol {1, 4, 5, 6}

The ‘Last SC-FDMA symbol’ of the extended CP of Table 3 represents thatthe location of symbol periods to which the control information 3 ismapped may be modified due to the SRS.

TABLE 4 CP Configuration SRS Configuration Column Set Normal No SRS {1,4, 7, 10} First SC-FDMA symbol {0, 3, 6, 9} Last SC-FDMA symbol {1, 4,7, 10} Extended No SRS {1, 4, 6, 9} First SC-FDMA symbol {0, 3, 5, 8}Last SC-FDMA symbol {1, 4, 6, 9}

In the extended CP, the SRS may not be permitted to be mapped to thelast symbol period, or even if the SRS is permitted, the SRS may bedropped. The extended CP of Table 4 can be used when the ‘Last SC-FDMAsymbol’ SRS is not permitted, or the ‘Last SC-FDMA symbol’ SRS can bedropped even though the ‘Last SC-FDMA symbol’ SRS is permitted. If thefirst SC-FDMA symbol SRS is not used, the extended CP of Table 4 may beconstructed without the first SC-FDMA symbol part (including ‘Columnset’ thereof).

TABLE 5 CP Configuration SRS Configuration Column Set Normal No SRS {1,4, 7, 10} Last SC-FDMA {1, 4, 7, 10} symbol Extended No SRS {1, 4, 6, 9}Last SC-FDMA {1, 4, 6, 9} symbol

Referring to FIGS. 14 a and 14 b, it can be understood that theconfiguration of ‘Column Set’ of Table 5 corresponds to the secondsymbol period area. That is, the control information 3 is mapped to asymbol period separated from a symbol period allocated for RS mapping byone symbol period. Although number ‘9’ in ‘Last SC-FDMA symbol’ of theextended CP indicates the location of the SRS, such a configuration maybe used when the SRS is not permitted to be mapped to the last symbolperiod, or when the SRS is dropped even though the SRS is permitted.Further, since the location of the ‘Column Set’ in each CP configurationis the same, Table 5 may be indicated by a configuration without theSRS.

TABLE 6 CP Configuration SRS Configuration Column Set Normal No SRS {1,4, 7, 10} Last SC-FDMA {1, 4, 7, 10} symbol Extended No SRS {1, 4, 6, 9}Last SC-FDMA {1, 4, 6, 5} symbol

Referring to FIGS. 14 a and 14 b, it can be understood that eachconfiguration of Table 6 except for ‘Last SC-FDMA symbol’ in theextended CP corresponds to the second symbol period area. Moreover, itcan be understood that the control information 3 is not mapped toresource elements of the first symbol period. ‘Last SC-FDMA symbol’ ofthe extended CP of Table 6 is not mapped to a symbol period ‘9’ becausean SRS is mapped to the location of the symbol period ‘9’. ComparingTable 6 with Table 5, the configurations of ‘Last SC-FDMA symbol’ in theextended CP are different. Namely, the control symbol 3 located in thesymbol period ‘9’ in Table 5 is mapped to a symbol period ‘5’ which isnot adjacent to a symbol period allocated for RS mapping in Table 6. Inthe extended CP of Table 6, ‘Column set’ {1, 4, 6, 5} of ‘Last SC-FDMAsymbol’ means that a symbol period ‘6’ may have a higher priority formapping than a symbol period ‘5’ because the symbol period ‘6’ is nearerto the symbol period allocated for RS mapping are mapped than the symbolperiod ‘5’. In more detail, in a process of uniformly filling thecontrol information to each symbol period symbol, the symbol period ‘6’has priority over the symbol period ‘5’ if the control informationshould be filled in only one of the symbols periods ‘5’ and ‘6’.However, even though the column set is indicated by {1, 4, 6, 5},priority may be allocated in order of {1, 4, 5, 6}. The location of thesymbol period to which the control information 3 is mapped is important.

TABLE 7 CP Configuration SRS Configuration Column Set Normal No SRS {1,4, 7, 10} Last SC-FDMA {1, 4, 7, 10} symbol Extended No SRS {1, 4, 6, 5}Last SC-FDMA {1, 4, 6, 5} symbol

Referring to FIGS. 14 a and 14 b, it can be appreciated that theconfiguration of the extended CP of Table 7 corresponds to the secondsymbol period area. It can also be appreciated in Table 7 that thecontrol information 3 is not mapped to resource elements of the firstsymbol period. Unlike Table 5 and Table 6, Table 7 has the same ‘ColumnSet’ in the extended CP irrespective of an SRS configuration. In theextended CP of Table 7, ‘Column set’ {1, 4, 6, 5} of ‘Last SC-FDMAsymbol’ means that a symbol period ‘6’ may have a higher priority formapping than a symbol period ‘5’ because the symbol period ‘6’ is nearerto the symbol period allocated for RS mapping than the symbol period‘5’. In more detail, in a process of uniformly filling the controlinformation to each symbol period symbol, the symbol period ‘6’ haspriority over the symbol period ‘5’ if the control information should befilled in only one of the symbol periods ‘5’ and ‘6’. However, eventhough the column set is indicated by {1, 4, 6, 5}, priority may beallocated in order of {1, 4, 5, 6}. The location of the symbol period towhich the control information 3 is mapped is important. Since Table 7has the same ‘Column Set’ in each CP irrespective of the SRSconfiguration, Table 7 may be indicated without the SRS configuration.

FIGS. 15 a and 15 b illustrate exemplary structures of an extended CP toexplain configurations of the following Table 8 and Table 9.

TABLE 8 CP Configuration SRS Configuration Column Set Normal No SRS {1,4, 7, 10} Last SC-FDMA {1, 4, 7, 10} symbol Extended No SRS {0, 3, 5, 8}Last SC-FDMA {0, 3, 5, 8} symbol

Table 8 illustrates a configuration when a symbol period allocated forRS mapping in an extended CP is changed. Especially, it is assumed inTable 8 that the RS is located in the third (‘{circle around (3)}’) andthe ninth (‘{circle around (9)}’) symbol periods (refer to FIG. 15 a).In the extended CP of Table 8, the control information 3 is mapped to asymbol period separated from the symbol period allocated for RS mappingby one symbol period. That is, the control information 3 is mapped tothe second symbol period. Referring to Table 8, it can be appreciatedthat the location of the symbol period to which the control information3 is mapped may be changed according to locations of an RS and an SRS.

TABLE 9 CP Configuration SRS Configuration Column Set Normal No SRS {1,4, 7, 10} Last SC-FDMA {1, 4, 7, 10} symbol Extended No SRS {1, 4, 5, 8}Last SC-FDMA {1, 4, 5, 8} symbol

Table 9 illustrates a configuration when a symbol period allocated forRS mapping in the extended CP is changed. Especially, it is assumed inTable 9 that the RS is located in the fourth (‘{circle around (4)}’) andthe ninth (‘{circle around (9)}’) symbol periods (refer to FIG. 15 b).

FIGS. 16 and 17 illustrate an example of locations to which an SRS andan RS are allocated within one subframe in case of a normal CP and anextended CP, respectively.

FIG. 16 and FIG. 17 correspond to FIG. 14 a and FIG. 14 b, respectively,and illustrate cases where an SRS is not mapped and an SRS is mapped tothe last symbol. The control information 3 is mapped to a symbol periodseparated by one symbol length from a symbol period allocated for RSmapping in consideration of a modulation order. Therefore, in FIG. 16,the control information 3 is mapped to symbol periods having indexes of1, 4, 7, and 10. In FIG. 17, the control information 3 is mapped tosymbol periods having indexes of 1, 4, 6, and 9.

Embodiment 7

FIGS. 18 a to 18 f illustrate a mapping order of control information 2and/or control information 3 in a time direction within one subcarrieraccording to the present invention.

Each of the control information 2 and the control information 3 can bemapped to a maximum of 4 resource elements per subcarrier. FIGS. 18 a to18 f illustrate a mapping order of symbols for 4 resource elementswithin one subcarrier. Although a symbol number to which each controlinformation is mapped may be changed according to a CP configuration, anrelative indexing order may be determined as illustrated in FIGS. 18 ato 18 f. FIGS. 18 a to 18 f show examples of mapping 10 symbolsgenerated after encoding in a normal CP configuration without an SRS.

Hereinafter, FIGS. 18 a to 18 f will be described based on the controlinformation 2.

In FIGS. 18 a to 18 f, only the first symbol period area is shown. InFIG. 18 a, the control information 2 is mapped in an upward directionfrom the last subcarrier of the first symbol period area and is mappedaccording to time flow within each subcarrier. In this case, controlinformation 2 is mapped to all 4 available resource elements within thelast subcarrier of the first symbol period area.

In FIG. 18 b, the control information 2 is mapped in a downwarddirection from a specific subcarrier of the first symbol period area inconsideration of the number of symbols of the control information 2 andis mapped according to time flow within each subcarrier. In this case,control information 2 is mapped to all 4 available resource elementswithin the specific subcarrier and is mapped also to resource elementswithin the last subcarrier of the first symbol period area.

In FIG. 18 c, the control information 2 is mapped in a downwarddirection from a specific subcarrier of the first symbol period area inconsideration of the number of symbols of the control information 2 andis mapped according to time flow within each subcarrier. In this case,the control information 2 is mapped to all 4 available resource elementswithin the last subcarrier of the first symbol period area.

In FIG. 18 d, the control information 2 is mapped in an upward directionfrom the last subcarrier of the first symbol period area and is mappedin reverse order of time flow within each subcarrier. In this case, thecontrol information 2 is mapped to all 4 available resource elementswithin the last subcarrier of the first symbol period area. In thismanner, when four or more of the control information 2 are mapped, it isguaranteed that all of the four available resource elements within thelast subcarrier of the first symbol period area are used for mapping.

In FIG. 18 e, the control information 2 is mapped in an upward directionfrom the last subcarrier of the first symbol period area inconsideration of the number of symbols of the control information 2 andis mapped in reverse order of time flow within each subcarrier. In thiscase, the control information 2 is mapped to all 4 available resourceelements within the top subcarrier.

FIG. 18 f, which is a modification of the method of FIG. 18 d, modifiesa mapping order of 4 resource elements within each subcarrier. In moredetail, the control information 2 is cyclically shifted by one to theright in the method in which mapping is performed in a reverse order oftime flow within each subcarrier. The control information 2 may becyclically shifted by two or three.

While FIGS. 18 a to 18 f illustrate a mapping order of the controlinformation 2, the same method may be applied to the control information3.

FIGS. 19 a to 21 b are views explaining in detail the methods of FIGS.18 a to 18 f, and illustrate examples of applying the methods of FIGS.18 a to 18 f to a set of resource elements having a matrix structure ofR×C. FIGS. 19 a and 19 b correspond to FIGS. 18 a and 18 b, FIGS. 20 aand 20 b correspond to FIGS. 18 c and 18 d, and FIGS. 21 a and 21 bcorrespond to FIGS. 18 e and 18 f.

In FIGS. 2 to 21 b, a relative relationship of a location to which thedata information and the control information are mapped and a locationto which an RS is mapped has been described using a set of physicalresource elements including resource elements allocated for RS mapping.It will be understood that the above-described embodiments may bedescribed using a structure of a time-frequency matrix excluding theresource elements allocated for RS mapping from the set of physicalresource elements.

The data information and control information mapped to the set ofphysical resource elements in FIGS. 2 to 21 b may be scrambled andmodulation-mapped, and then may be input to a resource element mapperthrough a transform precoder as in a processing method of a PUSCH in3GPP TS 36.211. Abbreviations used herein refer to abbreviationsdisclosed in 3GPP TS 36.212.

In the method of FIG. 13 according to the present invention, a methodfor applying an example of multiplexing CQI/PMI and RI, which arecontrol information, with data information, to 3GPP TS 36.212 V8.2.0will be described.

Hereinafter, f₀, f₁, f₂, . . . , f_(G−1) denotes input data, q₀, q₁, q₂,. . . , q_(Q−1) denotes input rank information (RI), and g₀, g₁, g₂, . .. , g_(H′−1) denotes a multiplexed output. Here, H′=G′±Q′.

Multiplexing can be performed through the following steps.

1. Determine the number of symbols per subframe using the followingequation:

N _(symb) ^(PUSCH)=(2·(N _(symb) ^(UL)−1)−N _(SRS))

Here, N_(symb) ^(PUSCH) denotes the number of SC-FDMA symbols whichtransmit a PUSCH in one subframe, N_(symb) ^(UL) denotes the number ofsymbols within one uplink slot, N_(SRS) denotes the number of symbolsused to transmit an SRS within one subframe.

2. Determine the number G′ of modulation symbols of data informationusing the following equation:

G′=G/Qm1

(where Qm1 is a modulation order of data)

3. Determine the number Q′ of modulation symbols of rank informationusing the following equation:

Q′=Q/Qm2

(where Qm2 is a modulation order of rank information)

4. Determine the number K of subcarriers occupied by modulation symbolsof rank information using the following equation:

K=ceil(Q′/maximum number of resources for rank information)

5. Determine the number of modulation symbols of rank information persymbol.

The number of modulation symbols of rank information per symbol isdetermined by a combination of ‘floor’ and ‘ceil’ in a symbol positionoccupied by each rank information based on Q′ or by a method determinedaccording to a remainder obtained by dividing the number of modulationsymbols of rank information by the number of symbols. In this case, themodulation symbols may be equally divided to a maximum of two slots, andmay be allocated from a front slot to a back slot or vice versa.

6. Multiplex the modulation symbols of the data information and the rankinformation.

Since the rank information should have a form stacked from the bottom ofa subcarrier, the data information should be mapped by a time-priorityscheme and the rank information should be mapped in a correspondingsymbol. At this time, since the data information is mapped from the topsubcarrier, the location of a subcarrier in which rank information canbe located is determined by subtracting a result of the above step 2from the entire number of subcarriers. Then the rank information ismapped in consideration of the number of symbols determined in the abovestep 3. This can be represented as a pseudo code as follows.

 For (from 0-th subcarrier to last subcarrier) {     If (currentsubcarrier number is less than value     obtained by subtracting K fromentire number of subcarriers) {    for (from SC-FDMA symbol 0 to numberof SC-FDMA    symbols per subframe)    {     map data as output onesymbol by one symbol     increase SC-FDMA symbol count     increase datasymbol count    }   else {    for (from SC-FDMA symbol 0 to the numberof SC-FDMA    symbols per subframe)    {     if (number of modulationsymbols of rank information     in corresponding SC-FDMA symbolcalculated in the above step 4 is 0) {      map data as output onesymbol by one symbol      increase SC-FDMA symbol count      increasedata symbol count     }     else {      map rank information as outputby one symbol      by one symbol      increase SC-FDMA symbol count     increase rank information count      delete number of modulationsymbols of rank      information in corresponding SC-FDMA symbolcalculated in the above step 4 by one     }    }   }   increasesubcarrier count  }

A detailed method for locating rank information between data due to ratematching rather than puncturing may be modified entirely or partially.

Hereinafter, in the method of FIG. 13 according to the presentinvention, another method of applying an example of multiplexing CQI/PMIand RI, which are control information, with data information to 3GPP TS36.212 V8.2.0 will be described.

It is assumed that the amount of RI does not intrude upon resourcesoccupied by CQI/PMI (the number of subcarriers including symbolsoccupied by RI and the number of subcarriers occupied by CQI/PMI do notexceed the entire number of subcarriers per subframe for PUSCHtransmission). Therefore, each of the RI, CQI/PMI, and data informationshould be considered to have a size which does not intrude upon eachother. If the RI, CQI/PMI, and data information intrude upon oneanother, the RI may use a modified form of the following method bypuncturing the CQI/PMI.

Here, q₀, q₁, q₂, q₃, . . . , q_(Q−1) denotes a CQI/PMI input, f₀, f₁,f₂, f₃, . . . , f_(G−1) denotes a data information input, q ₀ ^(RANK), q₁ ^(RANK), q ₂ ^(RANK), . . . , q _(Q) _(RANK) ⁻¹ ^(RANK) (a coded bit)or q ₀ ^(RANK), q ₁ ^(RANK), q ₂ ^(RANK), . . . , q _(Q′) _(RANK) ⁻¹^(RANK) (vector sequence, a symbol form considering a modulation order)denotes an RI input, and g ₀, g ₁, g ₂, . . . , g _(H′−1) denotes anoutput. If the RI is a coded bit, then H=(G+Q+Q_(RANK)) and H′=H/Qm. Ifthe RI is a vector sequence, then H′=H/Qm+Q′_(RANK).

N_(symb) ^(PUSCH)=(2·(N_(symb) ^(UL)−1)−N_(SRS)) denotes the number ofsymbols per subframe for PUSCH transmission, and N_(sc)^(PUSCH)=H′/N_(symb) ^(PUSCH) denotes the number of subcarriers carryinga PUSCH within one subframe.

The number of subcarriers used for rank information within onesubcarrier can be expressed by two equations. Namely, if the RI is acoded bit, then N_(sc) ^(RANK)=┌(Q_(RANK)/Q_(m))/4┐. Here, 4 is themaximum number of resources for the RI. A symbol such as ceil or floorneed not be used when a result of division has no remainder. If the RIis a vector sequence, then N_(sc) ^(RANK)=┌(Q′_(RANK)/Q_(m))/4┐. Here, 4is the maximum number of resources for the RI. A symbol such as ceil orfloor need not be used when a result of division has no remainder.

The number of rank information encoded as a bit/vector sequence withinthe i-th symbol carrying a PUSCH within one subframe is expressed by ni.

The number of bit/vector sequences for the RI mapped to respectivesymbols carrying a PUSCH with respect to a subframe having a normal CPmay refer to Table 10 to Table 12. Table 10 shows an ni value in asubframe having a normal CP. Table 11 shows an ni value in a subframehaving an extended CP without an SRS. Table 12 shows an ni value in asubframe having an extended CP with an SRS in the last symbol.

TABLE 10 i 0 1 2 3 4 5 6 7 8 9 10 11 0 └┌Q_(RANK)/2┐/2┘ 0 0┌┌Q_(RANK)/2┐/2┐ 0 0 ┌└Q_(RANK)/2┘/2┐ 0 0 └└Q_(RANK)/2┘/2┘ 0 or or or or└┌Q′_(RANK)/2┐/2┘ ┌┌Q′_(RANK)/2┐/2┐ ┌└Q′_(RANK)/2┘/2┐ └└Q′_(RANK)/2┘/2┘

Table 10 serves to evenly use symbols in which two slots and RI arelocated using ceil/floor down/modulo or a position priority of symbolsin which the RI is located. That is, the number of sequences may bedifferent by about 1 by various combinations of i of 1>4>7>10, 1>7>4>10,or 4>7>1>10 and Table 10 may be changed accordingly. Although two casesof Q_(RANK) and Q′_(RANK) have been described, an equation usingQ_(RANK) may be used if the Ri is a coded bit and an equation usingQ′_(RANK) may be used if the Ri is a vector sequence.

TABLE 11 i 0 1 2 3 4 5 6 7 8 9 0 └┌Q_(RANK)/ 0 0 ┌┌Q_(RANK)/ 0┌└Q_(RANK)/ 0 0 └└Q_(RANK)/ 2┐/2┘ 2┐/2┐ 2┘/2┐ 2┘/2┘ or or or or└┌Q′_(RANK)/ ┌┌Q′_(RANK)/ ┌└Q′_(RANK)/ └└Q′_(RANK)/ 2┐/2┘ 2┐/2┐ 2┘/2┐2┘/2┘

Table 11 serves to evenly use symbols in which two slots and RI arelocated using ceil/floor/modulo or a position priority of symbols inwhich the RI is located. That is, the number of sequences may bedifferent by about 1 by various combinations of i of 1>4>6>9, 1>6>4>9,or 4>6>1>9 and Table 11 may be changed accordingly. Although two casesof Q_(RANK) and Q′_(RANK) have been described, an equation usingQ_(RANK) may be used if the Ri is a coded bit and an equation usingQ′_(RANK) may be used if the Ri is a vector sequence.

TABLE 12 i 0 1 2 3 4 5 6 7 8 0 └┌Q_(RANK)/ 0 0 ┌┌Q_(RANK)/ └└Q_(RANK)/┌└Q_(RANK)/ 0 0 2┐/2┘ 2┐/2┐ 2┘/2┘ 2┘/2┐ or or or or └┌Q′_(RANK)/┌┌Q′_(RANK)/ └└Q′_(RANK)/ ┌└Q′_(RANK)/ 2┐/2┘ 2┐/2┐ 2┘/2┘ 2┘/2┐

Table 12 serves to use symbols in which two slots and RI are locatedusing ceil/floor/modulo or a position priority of symbols in which theRI is located. That is, the number of sequences may be different byabout 1 by various combinations of i of 1>4>6>5, 1>6>5>4, or 4>6>1>5 andTable 12 may be changed accordingly. Although two cases of Q_(RANK) andQ′_(RANK) have been described, an equation using Q_(RANK) may be used ifthe Ri is a coded bit and an equation using Q′_(RANK) may be used if theRi is a vector sequence.

Control information, rank information, and data information may bemultiplexed as follows.

set i, j, k, l, m to 0 while l < H’- ^(N) _(SC) ^(RANK)   if j < Q --CQI/PMI     g _(k) = [q_(j) ...q_(j+Q) _(m) ⁻¹]^(T)     j = j + Q_(m)  else -- data     g _(k) = [f_(i) ... f_(i+Q) _(m) ⁻¹]^(T)     i = i +Q_(m)   end if   k = k + 1   l = l + 1 end while while l < H′  ifn_(l mod Nsymb) ^(PUSCH) > 0 _(-- RANK)    g _(k) =[q _(m) ^(RANK) ...q_(m+Q) _(m) ⁻¹ ^(Rank)]^(T)    m = m + Q_(m)    n_(l mod N) _(symb)^(PUSCH) = n_(l mod N) _(symb) ^(PUSCH) −Q_(m)  else -- data     g _(k)= [f_(i) ... f_(i+Q) _(m) ⁻¹]^(T)     i = i + Q_(m)  end if  k = k + 1 l = l + 1 end while

If RI is a coded bit, g _(k)=[q _(m) ^(RANK) . . . q _(m+Q) _(m) ⁻¹^(RANK)]^(T), m=m+Q_(m), and n_(l mod N) _(symb) ^(PUSCH)=n_(l mod N)_(symb) ^(PUSCH)−Q_(m) may be used, and if the RI is a vector sequence,g _(k)=q _(m) ^(RANK), m=m+1, and n_(l mod N) _(symb)^(PUSCH)=n_(l mod N) _(symb) ^(PUSCH) ⁻¹ may be used.

In the method of FIG. 13 according to the present invention, anothermethod for applying an example of multiplexing CQI/PMI and RI, which arecontrol information, with data information, to 3GPP TS 36.212 V8.2.0will be described.

FIG. 22 illustrates a processing structure for a UL-SCH transportchannel according to an exemplary embodiment of the present invention.Data is input to a coding unit with a maximum of one transport blockevery TTI. Referring to FIG. 22, processes for attaching CRC to thetransport block, segmenting a code block and attaching CRC to thesegmented code block, channel-coding data information and controlinformation, performing rate matching, concatenating the code block,multiplexing the data information and control information, andperforming channel interleaving are carried out.

Hereinafter, the process for attaching CRC to a transport block isdescribed. Error detection is provided on UL-SCH transport blocksthrough a Cyclic Redundancy Check (CRC).

The entire transport block is used to calculate the CRC parity bits.Denote the bits in a transport block delivered to layer 1 by a₀, a₁, a₂,a₃, . . . , a_(A−1) and the parity bits by p₀, p₁, p₂, p₃, . . . ,p_(L−1). A is the size of the transport block and L is the number ofparity bits.

The parity bits are computed and attached to the UL-SCH transport blockaccording to subclause 5.1.1 setting L to 24 bits and using thegenerator polynomial g_(CRC24A)(D).

The process for segmenting a code block and attaching CRC to thesegmented code block will now be described. The bits input to the codeblock segmentation are denoted by b₀, b₁, b₂, b₃, . . . , b_(B−1) whereB is the number of bits in the transport block (including CRC).

Code block segmentation and code block CRC attachment are performedaccording to subclause 5.1.2.

The bits after code block segmentation are denoted by c_(r0), c_(r1),c_(r2), c_(r3), . . . , c_(r(K) _(r) ⁻¹⁾, where r is the code blocknumber and K_(r) is the number of bits for code block number r.

Channel coding for a UL-SCH will now be described. Code blocks aredelivered to the channel coding block. The bits in a code block aredenoted by c_(r0), c_(r1), c_(r2), c_(r3), . . . , c_(r(K) _(r) ⁻¹⁾,where r is the code block number, and K_(r) is the number of bits incode block number r. The total number of code blocks is denoted by C andeach code block is individually turbo encoded according to subclause5.1.3.2.

After encoding the bits are denoted by d_(r0) ^((i)), d_(r1) ^((i)),d_(r2) ^((i)), d_(r3) ^((i)), . . . , d_(r(D) _(r) ⁻¹⁾ ^((i)), withi=0,1, and 2 and where D_(r) is the number of bits on the i-th codedstream for code block number r, i.e. D_(r)=K_(r)+4.

Hereinafter, rate matching is described. Turbo coded blocks aredelivered to the rate matching block. They are denoted by d_(r0) ^((i)),d_(r1) ^((i)), d_(r2) ^((i)), d_(r3) ^((i)), . . . , d_(r(D) _(r) ⁻¹⁾^((i)), with i=0,1, and 2, and where r is the code block number, i isthe coded stream index, and D_(r) is the number of bits in each codedstream of code block number r. The total number of code blocks isdenoted by C and each coded block is individually rate matched accordingto subclause 5.1.4.1.

After rate matching, the bits are denoted by e_(r0), e_(r1), e_(r2),e_(r3), . . . , e_(r(E) _(r) ⁻¹⁾, where r is the coded block number, andwhere E_(r) is the number of rate matched bits for code block number r.

Hereinafter, code block concatenation is described. The bits input tothe code block concatenation block are denoted by e_(r0), e_(r1),e_(r2), e_(r3), . . . , e_(r(E) _(r) ⁻¹⁾, and where E_(r) is the numberof rate matched bits for the r-th code block.

Code block concatenation is performed according to subclause 5.1.5.

The bits after code block concatenation are denoted by f₀, f₁, f₂, . . ., f_(G−1), where G is the total number of coded bits for transmissionexcluding the bits used for control transmission, when controlinformation is multiplexed with the UL-SCH transmission.

Hereinafter, channel coding for control information is described.Control data arrives at the coding unit in the form of channel qualityinformation (CQI and/or PMI), HARQ-ACK and rank indication. Differentcoding rates for the control information are achieved by allocatingdifferent number of coded symbols for its transmission. When controldata are transmitted in the PUSCH, the channel coding for HARQ-ACK, rankindication and channel quality information o₀, o₁, o₂, . . . , o_(O−1)is done independently.

-   -   If HARQ-ACK consists of 1-bit of information, i.e., [o₀ ^(ACK)],        it is first encoded according to Table 5.2.2-1.    -   If HARQ-ACK consists of 2-bits of information, i.e., [o₁ ^(ACK)        o₀ ^(ACK)], it is first encoded according to Table 5.2.2-2.

TABLE 13 Q_(m) Encoded HARQ-ACK 2 [o₀ ^(ACK) X] 4 [o₀ ^(ACK) x x x] 6[o₀ ^(ACK) x x x x x]

TABLE 14 Q_(m) Encoded HARQ-ACK 2 [o₁ ^(ACK) o₀ ^(ACK)] 4 [o₁ ^(ACK) o₀^(ACK) x x] 6 [o₁ ^(ACK) o₀ ^(ACK) x x x x][Note from the editor: the ‘x’ above is a placeholder for 211 to treatbits with this value differently when performing scrambling of codedbits. This will enable limiting the constellation size used for ACKtransmission in PUSCH to QPSK.

The bit sequence q₀ ^(ACK), q₁ ^(ACK), q₂ ^(ACK), . . . , q_(Q) _(ACK)⁻¹ ^(ACK) is obtained by concatenation of multiple encoded HARQ-ACKblocks where Q_(ACK) is the total number of coded bit for all theencoded HARQ-ACK blocks. The vector sequence output of the channelcoding for HARQ-ACK information is denoted by q ₀ ^(ACK), q ₁ ^(ACK), .. . , q _(Q′) _(ACK) ⁻¹ ^(ACK), where Q′_(ACK)=Q_(ACK)/Q_(m), and isobtained as follows:

Set i ,k to 0 while i < Q_(ACK)  q _(k) ^(ACK) =[q_(i) ^(ACK) ...q_(i+Q)_(m) ⁻¹ ^(ACK)]^(T)   i = i + Q_(m)   k = k + 1 end whileFor rank indication (RI)

-   -   If RI consists of 1-bit of information, i.e., [o₀ ^(RI)], it is        first encoded according to Table 5.2.2-3.    -   If RI consists of 2-bits of information, i.e., [o₀ ^(RI) o₁        ^(RI)], it is first encoded according to Table 5.2.2-4 where o₂        ^(RI)=(o₀ ^(RI)+o₁ ^(RI)) mod 2.

TABLE 15 Q_(m) Encoded RI 2 [o₀ ^(RI) X] 4 [o₀ ^(RI) x x x] 6 [o₀ ^(RI)x x x x x]

TABLE 16 Q_(m) Encoded RI 2 [o₀ ^(RI) o₁ ^(RI) o₂ ^(RI) o₀ ^(RI) o₁^(RI) o₂ ^(RI)] 4 [o₀ ^(RI) o₁ ^(RI) x x o₂ ^(RI) o₀ ^(RI) x x o₁ ^(RI)o₂ ^(RI) x x] 6 [o₀ ^(RI) o₁ ^(RI) x x x x o₂ ^(RI) o₀ ^(RI) x x x x o₁^(RI) o₂ ^(RI) x x x x]

The “x” in Table 15 and 16 are placeholders for 3GPP TS 36.211 toscramble the RI bits in a way that maximizes the Euclidean distance ofthe modulation symbols carrying rank information.

The bit sequence q₀ ^(RI), q₁ ^(RI), q₂ ^(RI), . . . , q_(Q) _(RI) ⁻¹^(RI) is obtained by concatenation of multiple encoded RI blocks whereQ_(RI) is the total number of coded bit for all the encoded RI blocks.The last concatenation of the encoded RI block may be partial so thatthe total bit sequence length is equal to Q_(RI). The vector sequenceoutput of the channel coding for rank information is denoted by q ₀^(RI), q ₁ ^(RI), . . . , q _(Q′) _(RI) ⁻¹ ^(RI), whereQ′_(RI)=Q_(RI)/Q_(m), and is obtained as follows:

Set i ,k to 0 while i < Q_(RI)  q _(k) ^(RI) = [q_(i) ^(RI) ...q_(i+Q)_(m) ⁻¹ ^(RI)]^(T)   i = i + Q_(m)   k = k + 1 end while

For channel quality control information (CQI and/or PMI)

-   -   If the payload size is less than or equal to 11 bits, the        channel coding of the channel quality information is performed        according to subclause 5.2.3.3 of 3GPP TS 36.212 with input        sequence o₀, o₁, o₂, . . . , o_(O−1).    -   For payload sizes greater than 11 bits, the channel coding and        rate matching of the channel quality information is performed        according to subclause 5.1.3.1 and 5.1.4.2 of 3GPP TS 36.212        with input sequence o₀, o₁, o₂, . . . , o_(O−1).

The output sequence for the channel coding of channel qualityinformation is denoted by q₀, q₁, q₂, q₃, . . . , q_(Q−1).

The control and data multiplexing is performed such that HARQ-ACKinformation is present on both slots and is mapped to resources aroundthe demodulation reference signals. In addition, the multiplexingensures that control and data information are mapped to differentmodulation symbols.

The inputs to the data and control multiplexing are the coded bits ofthe control information denoted by q₀, q₁, q₂, q₃, . . . , q_(Q−1) andthe coded bits of the UL-SCH denoted by f₀, f₁, f₂, f₃, . . . , f_(G−1).The output of the data and control multiplexing operation is denoted byg ₀, g ₁, g ₂, g ₃, . . . , g _(H′−1), where H=(G+Q) and H′=H/Q_(m), andwhere g _(i), i=0, . . . , H′−1 are column vectors of length Q_(m). H isthe total number of coded bits allocated for UL-SCH data and CQI/PMIdata.

Denote the number of SC-FDMA symbols per subframe for PUSCH transmissionby N_(symb) ^(PUSCH)=(2·(N_(symb) ^(UL)−1)−N_(SRS)).

The control information and the data shall be multiplexed as follows:

Set i,j, k to 0 while j < Q -- first place the control information  g_(k) =[q_(j) ...q_(j+Q) _(m) ⁻¹]^(T)   j = j + Q_(m)   k = k + 1 endwhile while i < G -- then place the data   g _(k) =[f_(i) ...f_(i+Q)_(m) ⁻¹]^(T)   i = i + Q _(m)   k = k + 1 end while

Hereinafter, channel interleaver is described.

The channel interleaver described in this subclause in conjunction withthe resource element mapping for PUSCH in 3GPP TS 36.211 implements atime-first mapping of modulation symbols onto the transmit waveformwhile ensuring that the HARQ-ACK information is present on both slots inthe subframe and is mapped to resources around the uplink demodulationreference signals.

The input to the channel interleaver are denoted by g ₀, g ₁, g ₂, . . ., g _(H′−1), q ₀ ^(RI), q ₁ ^(RI), q ₂ ^(RI), . . . , q _(Q′) _(RI) ⁻¹^(RI) and q ₀ ^(ACK), q ₁ ^(ACK), q ₂ ^(ACK), . . . , q _(Q) _(ACK) ⁻¹^(ACK). The number of modulation symbols in the subframe is given byH″=H′+Q′_(RI). The output bit sequence from the channel interleaver isderived as follows:

(1) Assign C_(mux)=N_(symb) ^(PUSCH) to be the number of columns of thematrix. The columns of the matrix are numbered 0, 1, 2, . . . ,C_(mux)−1 from left to right.

(2) The number of rows of the matrix is R_(mux)=(H″·Q_(m)/C_(mux) and wedefine R′_(mux)=R_(mux)/Q_(m).

The rows of the rectangular matrix are numbered 0, 1, 2, . . . ,R_(mux)−1 from top to bottom.

(3) If rank information is transmitted in this subframe, the vectorsequence q ₀ ^(RI), q ₁ ^(RI), q ₂ ^(RI), . . . , q _(Q) _(RI) ⁻¹ ^(RI)is written onto the columns indicated by Table 5.2.2.8-1, and by sets ofQ_(m), rows starting from the last row and moving upwards according tothe following pseudocode.

Set i,j to 0. Set r to R′_(mux) −1  while i < Q′_(RI)   c_(RI) = ColumnSet(j)   y _(r×C) _(mux) _(+c) _(RI) =q _(i) ^(RI)   i = i + 1   r =R′_(mux) −1−└i/4┘   j = (j + 3)mod 4  end while

(4) Write the input vector sequence, i.e., y_(k)=g _(k) for k=0, 1, . .. , H′−1, into the (R_(mux)×C_(mux)) matrix by sets of Q_(m) rowsstarting with the −1) vector y₀, in column 0 and rows 0 to (Q_(m)−1) andskipping the matrix entries that are already occupied:

$\quad\begin{bmatrix}{\underset{\_}{y}}_{0} & {\underset{\_}{y}}_{1} & {\underset{\_}{y}}_{2} & \ldots & {\underset{\_}{y}}_{C_{mux} - 1} \\{\underset{\_}{y}}_{\;_{C_{mux}}} & {\underset{\_}{y}}_{C_{mux} + 1} & {\underset{\_}{y}}_{C_{mux} + 2} & \ldots & {\underset{\_}{y}}_{{2C_{mux}} - 1} \\\vdots & \vdots & \vdots & \ddots & \vdots \\{\underset{\_}{y}}_{{({R_{mux}^{\prime} - 1})} \times C_{mux}} & {\underset{\_}{y}}_{{{({R_{mux}^{\prime} - 1})} \times C_{mux}} + 1} & {\underset{\_}{y}}_{{{({R_{mux}^{\prime} - 1})} \times C_{mux}} + 2} & \ldots & {\underset{\_}{y}}_{({{R_{mux}^{\prime} \times C_{mux}} - 1})}\end{bmatrix}$

(5) If HARQ-ACK information is transmitted in this subframe, the vectorsequence q ₀ ^(ACK), q ₁ ^(ACK), q ₂ ^(ACK), . . . , q _(Q′) _(ACK) ⁻¹^(ACK) is written onto the columns indicated by Table 18, and by sets ofQ_(m) rows starting from the last row and moving upwards. Note that thisoperation overwrites some of the channel interleaver entries obtained instep (4).

(6) The output of the block interleaver is the bit sequence read outcolumn by column from the (R_(mux)×C_(mux)) matrix. The bits afterchannel interleaving are denoted by h₀, h₁, h₂, . . . , h_(H+Q) _(RI)⁻¹.

TABLE 17 CP configuration Column Set Normal {1, 4, 7, 10} Extended {0,3, 5, 8}

TABLE 18 CP configuration Column Set Normal {2, 3, 8, 9} Extended {1, 2,6, 7}

Although the above-described exemplary embodiments of the presentinvention may be used to a UL-SCH of 3GPP, it should be noted that thepresent invention is not limited thereto.

The exemplary embodiments described hereinabove are combinations ofelements and features of the present invention. The elements or featuresmay be considered selective unless otherwise mentioned. Each element orfeature may be practiced without being combined with other elements orfeatures. Further, the embodiments of the present invention may beconstructed by combining parts of the elements and/or features.Operation orders described in the embodiments of the present inventionmay be rearranged. Some constructions of any one embodiment may beincluded in another embodiment and may be replaced with correspondingconstructions of another embodiment. It is apparent that the presentinvention may be embodied by a combination of claims which do not havean explicit cited relation in the appended claims or may include newclaims by amendment after application.

The embodiments of the present invention may be achieved by variousmeans, for example, hardware, firmware, software, or a combinationthereof. In a hardware configuration, the embodiments of the presentinvention may be achieved by one or more application specific integratedcircuits (ASICs), digital signal processors (DSPs), digital signalprocessing devices (DSPDs), programmable logic devices (PLDs), fieldprogrammable gate arrays (FPGAs), processors, controllers,microcontrollers, microprocessors, etc.

In a firmware or software configuration, the embodiments of the presentinvention may be achieved by a module, a procedure, a function, etc.performing the above-described functions or operations. A software codemay be stored in a memory unit and driven by a processor. The memoryunit is located at the interior or exterior of the processor and maytransmit data to and receive data from the processor via various knownmeans.

It will be apparent to those skilled in the art that variousmodifications and variations can be made in the present inventionwithout departing from the spirit or scope of the invention. Thus, it isintended that the present invention cover the modifications andvariations of this invention provided they come within the scope of theappended claims and their equivalents.

The present invention may be applied to a user equipment, a basestation, and other devices of a wireless mobile communication system.

What is claimed is:
 1. A method of transmitting an uplink signal in awireless communication system, the method comprising: transmitting theuplink signal on a subframe, wherein the uplink signal includes rankinformation (RI) and Hybrid Automatic Repeat reQuest Acknowledgement(HARQ-ACK) information, the subframe includes 2 slots, each of the 2slots includes N Single Carrier Frequency Division Multiple Access(SC-FDMA) symbols, and N is 6 or 7, wherein a reference signal istransmitted on a SC-FDMA symbol in each of the 2 slots, the HARQinformation is transmitted on SC-FDMA symbols being closest to theSC-FDMA symbol for the reference signal in each of the 2 slots, and theRI information is transmitted on SC-FDMA symbols being contiguous to theSC-FDMA symbols for the HARQ information in each of the 2 slots.
 2. Themethod of claim 1, wherein N is 7 for a normal cyclic prefix.
 3. Themethod of claim 2, wherein the SC-FDMA symbol for the reference signalis 4^(th) SC-FDMA symbol in each of the 2 slots.
 4. The method of claim3, wherein the SC-FDMA symbols for the HARQ-ACK information are 3^(rd)and 5^(th) SC-FDMA symbols in each of the 2 slots.
 5. The method ofclaim 3, wherein the SC-FDMA symbols for the RI are 2^(nd) and 6^(th)SC-FDMA symbols in each of the 2 slots.
 6. The method of claim 1,wherein N is 6 for an extended cyclic prefix.
 7. The method of claim 6,wherein the SC-FDMA symbol for the reference signal is 3^(rd) SC-FDMAsymbol in each of the 2 slots.
 8. The method of claim 6, wherein theSC-FDMA symbols for the HARQ-ACK information are 2^(nd) and 4^(th)SC-FDMA symbols in the slot.
 9. The method of claim 6, wherein theSC-FDMA symbols for the RI are 1^(st) and 5^(th) SC-FDMA symbols in eachof the 2 slots.
 10. The method of claim 1, wherein the uplink signalfurther includes an uplink shared channel (UL-SCH) data and istransmitted via a Physical Uplink Shared Channel (PUSCH).
 11. Anapparatus for use in a wireless communication system, the apparatuscomprising: a module for transmitting an uplink signal on a subframe,wherein the uplink signal includes rank information (RI) and HybridAutomatic Repeat reQuest Acknowledgement (HARQ-ACK) information, thesubframe includes 2 slots, each of the 2 slots includes N Single CarrierFrequency Division Multiple Access (SC-FDMA) symbols, and N is 6 or 7,wherein a reference signal is transmitted on a SC-FDMA symbol in each ofthe 2 slots, the HARQ information is transmitted on SC-FDMA symbolsbeing closest to the SC-FDMA symbol for the reference signal in each ofthe 2 slots, and the RI information is transmitted on SC-FDMA symbolsbeing contiguous to the SC-FDMA symbols for the HARQ information in eachof the 2 slots.
 12. The apparatus of claim 11, wherein N is 7 for anormal cyclic prefix.
 13. The apparatus of claim 12, wherein the SC-FDMAsymbol for the reference signal is 4^(th) SC-FDMA symbol in each of the2 slots.
 14. The apparatus of claim 13, wherein the SC-FDMA symbols forthe HARQ-ACK information are 3^(rd) and 5^(th) SC-FDMA symbols in eachof the 2 slots.
 15. The apparatus of claim 13, wherein the SC-FDMAsymbols for the RI are 2^(nd) and 6^(th) SC-FDMA symbols in each of the2 slots.
 16. The apparatus of claim 11, wherein N is 6 for an extendedcyclic prefix.
 17. The apparatus of claim 16, wherein the SC-FDMA symbolfor the reference signal is 3^(rd) SC-FDMA symbol in each of the 2slots.
 18. The apparatus of claim 16, wherein the SC-FDMA symbols forthe HARQ-ACK information are 2^(nd) and 4^(th) SC-FDMA symbols in eachof the 2 slots.
 19. The apparatus of claim 16, wherein the SC-FDMAsymbols for the RI are 1^(st) and 5^(th) SC-FDMA symbols in each of the2 slots.
 20. The apparatus of claim 11, wherein the uplink signalfurther includes an uplink shared channel (UL-SCH) data and istransmitted via a Physical Uplink Shared Channel (PUSCH).